Small sum privacy and large sum utility in data publishing
نویسندگان
چکیده
منابع مشابه
Small sum privacy and large sum utility in data publishing
While the study of privacy preserving data publishing has drawn a lot of interest, some recent work has shown that existing mechanisms do not limit all inferences about individuals. This paper is a positive note in response to this finding. We point out that not all inference attacks should be countered, in contrast to all existing works known to us, and based on this we propose a model called ...
متن کاملSmall Count Privacy and Large Count Utility in Data Publishing
While the introduction of differential privacy has been a major breakthrough in the study of privacy preserving data publication, some recent work has pointed out a number of cases where it is not possible to limit inference about individuals. The dilemma that is intrinsic in the problem is the simultaneous requirement of data utility in the published data. Differential privacy does not aim to ...
متن کاملPreserving Privacy and Utility in RFID Data Publishing
Radio Frequency IDentification (RFID) is a technology that helps machines identify objects remotely. The RFID technology has been extensively used in many domains, such as mass transportation and healthcare management systems. The collected RFID data capture the detailed movement information of the tagged objects, offering tremendous opportunities for mining useful knowledge. Yet, publishing th...
متن کاملThe Boundary Between Privacy and Utility in Data Publishing
We consider the privacy problem in data publishing: given a database instance containing sensitive information “anonymize” it to obtain a view such that, on one hand attackers cannot learn any sensitive information from the view, and on the other hand legitimate users can use it to compute useful statistics. These are conflicting goals. In this paper we prove an almost crisp separation of the c...
متن کاملSum Graphs of Small Sum Number
Given an integer r > 0, let G r = (V; E) denote a graph consisting of a simple nite undirected connected nontrivial graph G together with r isolated vertices K r. Let L : V ! Z + denote a labelling of the vertices of G r with distinct positive integers. Then G r is said to be a sum graph if there exists a labelling L such that for every distinct vertex pair u and v of V , (u; v) 2 E if and only...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Biomedical Informatics
سال: 2014
ISSN: 1532-0464
DOI: 10.1016/j.jbi.2014.04.002